#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], t, cnt[N];
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) {
        if (t - cnt[a[i]] > 0)t--;
        t++;
        cnt[a[i]]++;
    }
    printf("%d", t);
    return 0;
}